Application of Exact String Matching Algorithms towards SMILES Representation of Chemical Structure
نویسندگان
چکیده
Bioinformatics and Cheminformatics use computer as disciplines providing tools for acquisition, storage, processing, analysis, integrate data and for the development of potential applications of biological and chemical data. A chemical database is one of the databases that exclusively designed to store chemical information. NMRShiftDB is one of the main databases that used to represent the chemical structures in 2D or 3D structures. SMILES format is one of many ways to write a chemical structure in a linear format. In this study we extracted Antimicrobial Structures in SMILES format from NMRShiftDB and stored it in our Local Data Warehouse with its corresponding information. Additionally, we developed a searching tool that would response to user’s query using the JME Editor tool that allows user to draw or edit molecules and converts the drawn structure into SMILES format. We applied Quick Search algorithm to search for Antimicrobial Structures in our Local Data Ware House. Keywords—Exact String-matching Algorithms; NMRShiftDB; SMILES Format; Antimicrobial Structures.
منابع مشابه
Towards a Universal SMILES representation - A standard method to generate canonical SMILES based on the InChI
UNLABELLED BACKGROUND There are two line notations of chemical structures that have established themselves in the field: the SMILES string and the InChI string. The InChI aims to provide a unique, or canonical, identifier for chemical structures, while SMILES strings are widely used for storage and interchange of chemical structures, but no standard exists to generate a canonical SMILES stri...
متن کاملTowards Faster String Matching
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Hannu Peltola Name of the doctoral dissertation Towards Faster String Matching Publisher Aalto University School of Science Unit Department of Computer Science Series Aalto University publication series DOCTORAL DISSERTATIONS 78/2013 Field of research Software Technology Manuscript submitted 11 December 2012 Date of the defenc...
متن کاملString Matching and its Applications in Diversified Fields
String searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.[11] String matching is a classical problem in computer science. In this paper we are trying to explore the various diversified fields where string matching has ...
متن کاملElectromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem
In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...
متن کاملLINGO, an Efficient Holographic Text Based Method To Calculate Biophysical Properties and Intermolecular Similarities
SMILES strings are the most compact text based molecular representations. Implicitly they contain the information needed to compute all kinds of molecular structures and, thus, molecular properties derived from these structures. We show that this implicit information can be accessed directly at SMILES string level without the need to apply explicit time-consuming conversion of the SMILES string...
متن کامل